Cognitive Science Colloquium

How Tacit Is Tacit Knowledge?

Our study concerns tacit knowledge that has been one of the most discussed concepts in the field of contemporary knowledge management. We are particularly interested in the issues concerning 1) the nature of tacit knowledge, and 2) the idea of explication of tacit knowledge. We approach these questions from the perspective of cognitive science. Tacit knowledge is deeply related to conceptual mo...

Round Complexity Versus Randomness Complexity in Interactive Proofs

Consider an interactive proof system for some set S that has randomness complexity r(n) for instances of length n, and arbitrary round complexity. We show a public-coin interactive proof system for S of round complexity O(r(n)/ log n). Furthermore, the randomness complexity is preserved up to a constant factor, and the resulting interactive proof system has perfect completeness. ∗Department of ...

Black-White Pebbling is PSPACE-Complete

The complexity of the Black-White Pebbling Game has remained an open problem for 30 years. It was devised to capture the power of non-deterministic space bounded computation. Since then it has been continuously studied and applied to problems in diverse areas of computer science including VLSI design and more recently propositional proof complexity. In 1983, determining its complexity was rated...

On a singular value method in quantum communication complexity

Natural Color Categories Are Convex Sets

The paper presents a statistical evaluation of the typological data about color naming systems across the languages of the world that have been obtained by the World Color Survey. In a first step, we discuss a principal component analysis of the categorization data that led to a small set of easily interpretable features that are dominant in color categorization. These features were used for a ...